(0) Obligation:
Clauses:
duplicate([], []).
duplicate(.(X, Y), .(X, .(X, Z))) :- duplicate(Y, Z).
Query: duplicate(g,a)
(1) PrologToDTProblemTransformerProof (SOUND transformation)
Built DT problem from termination graph DT10.
(2) Obligation:
Triples:
duplicateA(.(X1, .(X2, X3)), .(X1, .(X1, .(X2, .(X2, X4))))) :- duplicateA(X3, X4).
Clauses:
duplicatecA([], []).
duplicatecA(.(X1, []), .(X1, .(X1, []))).
duplicatecA(.(X1, .(X2, X3)), .(X1, .(X1, .(X2, .(X2, X4))))) :- duplicatecA(X3, X4).
Afs:
duplicateA(x1, x2) = duplicateA(x1)
(3) TriplesToPiDPProof (SOUND transformation)
We use the technique of [DT09]. With regard to the inferred argument filtering the predicates were used in the following modes:
duplicateA_in: (b,f)
Transforming
TRIPLES into the following
Term Rewriting System:
Pi DP problem:
The TRS P consists of the following rules:
DUPLICATEA_IN_GA(.(X1, .(X2, X3)), .(X1, .(X1, .(X2, .(X2, X4))))) → U1_GA(X1, X2, X3, X4, duplicateA_in_ga(X3, X4))
DUPLICATEA_IN_GA(.(X1, .(X2, X3)), .(X1, .(X1, .(X2, .(X2, X4))))) → DUPLICATEA_IN_GA(X3, X4)
R is empty.
The argument filtering Pi contains the following mapping:
duplicateA_in_ga(
x1,
x2) =
duplicateA_in_ga(
x1)
.(
x1,
x2) =
.(
x1,
x2)
DUPLICATEA_IN_GA(
x1,
x2) =
DUPLICATEA_IN_GA(
x1)
U1_GA(
x1,
x2,
x3,
x4,
x5) =
U1_GA(
x1,
x2,
x3,
x5)
We have to consider all (P,R,Pi)-chains
Infinitary Constructor Rewriting Termination of PiDP implies Termination of TRIPLES
(4) Obligation:
Pi DP problem:
The TRS P consists of the following rules:
DUPLICATEA_IN_GA(.(X1, .(X2, X3)), .(X1, .(X1, .(X2, .(X2, X4))))) → U1_GA(X1, X2, X3, X4, duplicateA_in_ga(X3, X4))
DUPLICATEA_IN_GA(.(X1, .(X2, X3)), .(X1, .(X1, .(X2, .(X2, X4))))) → DUPLICATEA_IN_GA(X3, X4)
R is empty.
The argument filtering Pi contains the following mapping:
duplicateA_in_ga(
x1,
x2) =
duplicateA_in_ga(
x1)
.(
x1,
x2) =
.(
x1,
x2)
DUPLICATEA_IN_GA(
x1,
x2) =
DUPLICATEA_IN_GA(
x1)
U1_GA(
x1,
x2,
x3,
x4,
x5) =
U1_GA(
x1,
x2,
x3,
x5)
We have to consider all (P,R,Pi)-chains
(5) DependencyGraphProof (EQUIVALENT transformation)
The approximation of the Dependency Graph [LOPSTR] contains 1 SCC with 1 less node.
(6) Obligation:
Pi DP problem:
The TRS P consists of the following rules:
DUPLICATEA_IN_GA(.(X1, .(X2, X3)), .(X1, .(X1, .(X2, .(X2, X4))))) → DUPLICATEA_IN_GA(X3, X4)
R is empty.
The argument filtering Pi contains the following mapping:
.(
x1,
x2) =
.(
x1,
x2)
DUPLICATEA_IN_GA(
x1,
x2) =
DUPLICATEA_IN_GA(
x1)
We have to consider all (P,R,Pi)-chains
(7) PiDPToQDPProof (SOUND transformation)
Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.
(8) Obligation:
Q DP problem:
The TRS P consists of the following rules:
DUPLICATEA_IN_GA(.(X1, .(X2, X3))) → DUPLICATEA_IN_GA(X3)
R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
(9) QDPSizeChangeProof (EQUIVALENT transformation)
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.
From the DPs we obtained the following set of size-change graphs:
- DUPLICATEA_IN_GA(.(X1, .(X2, X3))) → DUPLICATEA_IN_GA(X3)
The graph contains the following edges 1 > 1
(10) YES